Simple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs
نویسنده
چکیده
In this paper we give a short survey on eecient algorithms for Steiner trees and paths packing problems in planar graphs. We particularly concentrate on recent results. The rst result is a linear-time algorithm for packing vertex-disjoint trees resp. paths within a planar graph, where the vertices to be connected lie on at most two diierent faces 26, 32]. This algorithm is based on a linear-time algorithm for the vertex-disjoint Menger problem in planar graphs 27]. The second result is a linear-time algorithm for packing edge-disjoint paths within a planar graph, where the vertices to be connected all lie on the boundary of the same face 34]. All algorithms discussed in detail in this paper admit a short and simple description, and are easy to implement.
منابع مشابه
The cavity approach for Steiner trees Packing problems
The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the Max-Sum algorithm. In particular, recent developments to solve the Edge-Disjoint paths problem and the Prize collecting Steiner tree Problem on graphs have shown remarkable results for several classes of graphs and for bench...
متن کاملPacking Paths and Steiner Trees: Routing of Electronic Circuits
One of the challenging problems in the design of electronic circuits is the so-called routing problem. Roughly speaking, the task is to connect so-called terminal sets via wires on a predeened area. In addition, certain design rules are to be taken into account and an objective function such as the wiring length must be minimized. The routing problem in general is too complex to be solved in on...
متن کاملToward Practical Planar Graph Algorithms
of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large planar graphs. By exploiting the special structure of planar graphs, it is often possible to design algorithms that are faster or give better results than their counterparts for general gra...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملParallel Algorithms for Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the terminals of a net. This paper presents four parallel algorithms for the Steiner forest problem and a related one. The first algorithm solves the problem for the case all the terminals are located on the outer boundary of G...
متن کامل